New Hybrid Conjugate Gradient Method with Global Convergence Properties under Exact Line Search
نویسندگان
چکیده
منابع مشابه
Some global convergence properties of the Wei-Yao-Liu conjugate gradient method with inexact line search
In [Z.Wei, S. Yao, L. Liu, The convergence properties of some new conjugate gradient methods, Applied Mathematics and Computation 183 (2006) 1341–1350], Wei et al. proposed a new conjugate gradient method called WYL method which has good numerical experiments and some excellent properties such as b k P 0. In this paper, we prove that while tk 6 1 c 2L kgkk kdkk , the sufficient descent conditio...
متن کاملGlobal Convergence of Conjugate Gradient Methods without Line Search
Global convergence results are derived for well-known conjugate gradient methods in which the line search step is replaced by a step whose length is determined by a formula. The results include the following cases: 1. The Fletcher-Reeves method, the Hestenes-Stiefel method, and the Dai-Yuan method applied to a strongly convex LC objective function; 2. The Polak-Ribière method and the Conjugate ...
متن کاملThe Gradient Projection Method with Exact Line Search
The gradient projection algorithm for function minimization is often implemented using an approximate local minimization along the projected negative gradient. On the other hand, for some difficult combinational optimization problems, where a starting guess may be far from a solution, it may be advantageous to perform a nonlocal (exact) line search. In this paper we show how to evaluate the pie...
متن کاملGlobal Convergence Properties of Conjugate Gradient Methods for Optimization
This paper explores the convergence of nonlinear conjugate gradient methods without restarts, and with practical line searches. The analysis covers two classes of methods that are globally convergent on smooth, nonconvex functions. Some properties of the Fletcher-Reeves method play an important role in the first family, whereas the second family shares an important property with the Polak-Ribir...
متن کاملA conjugate Rosen’s gradient projection method with global line search for piecewise linear optimization∗
The Kelley cutting plane method is one of the methods commonly used to optimize the dual function in the Lagrangian relaxation scheme. Usually the Kelley cutting plane method uses the simplex method as the optimization engine. It is well known that the simplex method leaves the current vertex, follows an ascending edge and stops at the nearest vertex. What would happen if one would continue the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Engineering & Technology
سال: 2018
ISSN: 2227-524X
DOI: 10.14419/ijet.v7i3.28.20965